Deadlock prevention by acyclic orientations
نویسندگان
چکیده
منابع مشابه
Deadlock Prevention by Acyclic Orientations
Deadlock prevention for routing messages has a central role in communication networks, since it directly innuences the correctness of parallel and distributed systems. In this paper we extend some of the computational results presented in 10] on acyclic orientations for the determination of optimal deadlock free routing schemes. In this context, minimizing the number of buuers needed to prevent...
متن کاملAcyclic Orientations for Deadlock Prevention in Usual Networks
Deadlock prevention for routing messages has a central role in communication networks , since it directly innuences the correctness of distributed and parallel systems. In this paper we extend some of the computational results presented in 10] on acyclic orientations for the determination of optimal deadlock free routing schemes. In this context minimizing the number of buuers, needed to preven...
متن کاملAcyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract)
In this paper we extend some of the computational results presented in 6] on the determination of an acyclic orientation of a graph which minimizes the maximum number of changes of orientations along the paths connecting a given subset of source-destination couples. The corresponding value is called the rank of the set of paths, and besides its theoretical interest has also practical applicatio...
متن کاملEquivalences on Acyclic Orientations
The cyclic and dihedral groups can be made to act on the set Acyc(Y ) of acyclic orientations of an undirected graph Y , and this gives rise to the equivalence relations ∼κ and ∼δ, respectively. These two actions and their corresponding equivalence classes are closely related to combinatorial problems arising in the context of Coxeter groups, sequential dynamical systems, the chip-firing game, ...
متن کاملAcyclic orientations of graphs
Let G be a finite graph with p vertices and x its chromatic polynomial. A combinatorial interpretation is given to the positive integer (-l)px(-A), where h is a positive integer, in terms of acyclic orientations of G. In particular, (-l)Px(-1) is the number of acyclic orientations of G. An application is given to the enumeration of labeled acyclic digraphs. An algebra of full binomial type, in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00232-9